A partitioned shift-without-invert algorithm to improve parallel eigensolution efficiency in real-space electronic transport

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A partitioned shift-without-invert algorithm to improve parallel eigensolution efficiency in real-space electronic transport

We present an eigenspectrum partitioning scheme without inversion for the recently described real-space electronic transport code, TRANSEC. The primary advantage of TRANSEC is its highly parallel algorithm, which enables studying conductance in large systems. The present scheme adds a new source of parallelization, significantly enhancing TRANSEC’s parallel scalability, especially for systems w...

متن کامل

A Real-Space Approach to Electronic Transport

Using orthogonal polynornials, a navet approach for studying DC and AC conductivity and velocity-velocity correlation function has been developed. The method works

متن کامل

Parallel Transport Frame in 4 -dimensional Euclidean Space

In this work, we give parallel transport frame of a curve and we introduce the relations between the frame and Frenet frame of the curve in 4-dimensional Euclidean space. The relation which is well known in Euclidean 3-space is generalized for the …rst time in 4-dimensional Euclidean space. Then we obtain the condition for spherical curves using the parallel transport frame of them. The conditi...

متن کامل

Shift-invert Arnoldi Approximation to the Toeplitz

The shift-invert Arnoldi method is employed to generate an orthonormal basis from the Krylov subspace corresponding to a real Toeplitz matrix and an initial vector. The vectors and recurrence coefficients produced by this method are exploited to approximate the Toeplitz matrix exponential. Toeplitz matrix inversion formula and rapid Toeplitz matrix-vector multiplications are utilized to lower t...

متن کامل

Backward error analysis of the shift-and-invert Arnoldi algorithm

We perform a backward error analysis of the inexact shift-and-invert Arnoldi algorithm. We consider inexactness in the solution of the arising linear systems, as well as in the orthonormalization steps, and take the non-orthonormality of the computed Krylov basis into account. We show that the computed basis and Hessenberg matrix satisfy an exact shift-and-invert Krylov relation for a perturbed...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Computer Physics Communications

سال: 2016

ISSN: 0010-4655

DOI: 10.1016/j.cpc.2016.05.015